Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sourcesCOSARES, S; HOCHBAUM, D. S.Mathematics of operations research. 1994, Vol 19, Num 1, pp 94-111, issn 0364-765XArticle

Conditions for the existence of solutions of the three-dimensional planar transportation problemVLACH, M.Discrete applied mathematics. 1986, Vol 13, Num 1, pp 61-78, issn 0166-218XArticle

Solution of constrained generalized transportation problems using the pivot and probe algorithmTHOMPSON, G. L; SETHI, A. P.Computers & operations research. 1986, Vol 13, Num 1, pp 1-9, issn 0305-0548Article

The A-forest iteration method for the stochastic generalized transportation problemLIQUN QI.Mathematics of operations research. 1987, Vol 12, Num 1, pp 1-21, issn 0364-765XArticle

Improving VAM for unbalanced transportation problemsGOYAL, S. K.The Journal of the Operational Research Society. 1984, Vol 35, Num 12, pp 1113-1114, issn 0160-5682Article

The factored transportation problemEVANS, J. R.Management science. 1984, Vol 30, Num 8, pp 1021-1024, issn 0025-1909Article

Transportation problems with inadmissible routesCURRIN, D. C.The Journal of the Operational Research Society. 1986, Vol 37, Num 4, pp 387-396, issn 0160-5682Article

Variables duales dans un programme continu de transport = Dual variables in continous program of transportationDUBUC, S; TANGUAY, M.Cahiers du Centre d'études de recherche opérationnelle. 1984, Vol 26, Num 1-2, pp 17-23, issn 0008-9737Article

Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costsOHUCHI, A; KAJI, I.Networks (New York, NY). 1984, Vol 14, Num 4, pp 515-530, issn 0028-3045Article

Estimation des paramètres des réseaux à structure complexeLITVAK, E. I; USHAKOV, I. A.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 3-17, issn 0002-3388Article

Some branch-and-bound procedures for fixed-cost transportation problemsCABOT, A. V; ERENGUE, S. S.Naval research logistics quarterly. 1984, Vol 31, Num 1, pp 145-154, issn 0028-1441Article

Note on independence of arcs in antiparallel for network flow problemsHAGSTROM, J. N.Networks (New York, NY). 1984, Vol 14, Num 4, pp 567-570, issn 0028-3045Article

A simple, easily programmed method for locating Rook's tours in the transportation problemWILSDON, C. E.The Journal of the Operational Research Society. 1990, Vol 41, Num 9, pp 879-880, issn 0160-5682Article

Resolution of degeneracy in transportation problemsSHAFAAT, A; GOYAL, S. K.The Journal of the Operational Research Society. 1988, Vol 39, Num 4, pp 411-413, issn 0160-5682Article

A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problemCHENG, T. C. E.Computers & operations research. 1990, Vol 17, Num 4, pp 425-426, issn 0305-0548, 2 p.Article

A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite familiesPINELIS, Iosif.Mathematical methods of operations research (Heidelberg). 2003, Vol 58, Num 1, pp 105-129, issn 1432-2994, 25 p.Article

Assigning slabs to orders : an example of appropriate model formulationVASKO, F. J; CREGGER, M. L; STOTT, K. L et al.Computers & industrial engineering. 1994, Vol 26, Num 4, pp 797-800, issn 0360-8352Article

An interactive computerized algorithm for multicriteria vehicle routing problemsPARK, Y. B; KOELLING, C. P.Computers & industrial engineering. 1989, Vol 16, Num 4, pp 477-490, issn 0360-8352, 14 p.Article

A partial dual algorithm for the capacitated warehouse location problemBAKER, B. M.European journal of operational research. 1986, Vol 23, Num 1, pp 48-56, issn 0377-2217Article

Alternative models of spatial competitionHARKER, P. T.Operations research. 1986, Vol 34, Num 3, pp 410-425, issn 0030-364XArticle

Realisation und Test von ausgewählten Algorithmen zu linearen Optimierungsproblemen auf Mikrocomputern = Réalisation et test d'algorithmes sélectionnés pour la programmation linéaire sur microordinateurs = Realising and testing selected algorithmes for linear programming or micro computersLUTZ, M; DUTSCHKE, T; FISCHER, S et al.Angewandte Informatik. 1985, Vol 27, Num 10, pp 440-444, issn 0013-5704Article

On programming problems with a linear-plus-linear-fractional objective functionHIRCHE, J.Cahiers du Centre d'études de recherche opérationnelle. 1984, Vol 26, Num 1-2, pp 59-64, issn 0008-9737Article

Nonoptimal edges for the symmetric traveling salesman problemJONKER, R; VOLGENANT, T.Operations research. 1984, Vol 32, Num 4, pp 837-846, issn 0030-364XArticle

A quick sufficient solution to the more-for-less paradox in the transportation problemADLAKHA, V; KOWALSKI, K.Omega (Oxford). 1998, Vol 26, Num 4, pp 541-547, issn 0305-0483Article

A vehicle routing improvement algorithm comparison of a «greedy» and a matching implementation for inventory routingDROR, M; LEVY, L.Computers & operations research. 1986, Vol 13, Num 1, pp 33-45, issn 0305-0548Article